Quantitative Tverberg Theorems Over Lattices and Other Discrete Sets
نویسندگان
چکیده
This paper presents a new variation of Tverberg’s theorem. Given a discrete set S of R, we study the number of points of S needed to guarantee the existence of an m-partition of the points such that the intersection of the m convex hulls of the parts contains at least k points of S. The proofs of the main results require new quantitative versions of Helly’s and Carathéodory’s theorems.
منابع مشابه
New Results in Tropical Discrete Geometry
Following the recent work of Develin and Sturmfels and others (see, e.g., [10, 16, 2, 11]), we investigate discrete geometric questions over the tropical semiring (R, min, +). Specifically, we obtain the following tropical analogues of classical theorems in convex geometry: a separation theorem for a pair of disjoint tropical polytopes by tropical halfspaces and tropical versions of Radon’s lem...
متن کاملProjective Center Point and Tverberg Theorems
We present projective versions of the center point theorem and Tverberg’s theorem, interpolating between the original and the so-called “dual” center point and Tverberg theorems. Furthermore we give a common generalization of these and many other known (transversal, constraint, dual, and colorful) Tverberg type results in a single theorem, as well as some essentially new results about partition...
متن کاملThe discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
We discuss five discrete results: the lemmas of Sperner and Tucker from combinatorial topology and the theorems of Carathéodory, Helly, and Tverberg from combinatorial geometry. We explore their connections and emphasize their broad impact in application areas such as game theory, graph theory, mathematical optimization, computational geometry, etc.
متن کاملCarathéodory, Helly and the Others in the Max-Plus World
Carathéodory’s, Helly’s and Radon’s theorems are three basic results in discrete geometry. Their max-plus counterparts have been proved by various authors. In this paper, more advanced results in discrete geometry are shown to have also their max-plus counterparts: namely, the colorful Carathéodory theorem and the Tverberg theorem. A conjecture connected to the Tverberg theorem – Sierksma’s con...
متن کاملVery Colorful Theorems
We prove several colorful generalizations of classical theorems in discrete geometry. Moreover, the colorful generalization of Kirchberger’s theorem gives a generalization of the theorem of Tverberg on non-separated partitions.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete & Computational Geometry
دوره 58 شماره
صفحات -
تاریخ انتشار 2017